Ela the Minimum Algebraic Connectivity of Caterpillar Unicyclic Graphs
نویسنده
چکیده
A caterpillar unicyclic graph is a unicyclic graph in which the removal of all pendant vertices makes it a cycle. In this paper, the unique caterpillar unicyclic graph with minimum algebraic connectivity among all caterpillar unicyclic graphs is determined.
منابع مشابه
On the Eccentric Connectivity Index of Unicyclic Graphs
In this paper, we obtain the upper and lower bounds on the eccen- tricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.
متن کاملThe smallest values of algebraic connectivity for unicyclic graphs
The algebraic connectivity ofG is the second smallest eigenvalue of its Laplacianmatrix. Let Un be the set of all unicyclic graphs of order n. In this paper, wewill provide the ordering of unicyclic graphs inUn up to the last seven graphs according to their algebraic connectivities when n ≥ 13. This extends the results of Liu and Liu [Y. Liu, Y. Liu, The ordering of unicyclic graphswith the sma...
متن کاملEla on 3-colored Digraphs with Exactly One Nonsingular Cycle
The class of connected 3-colored digraphs containing exactly one nonsingular cycle is considered in this article. The main objective is to study the smallest Laplacian eigenvalue and the corresponding eigenvectors of such graphs. It is shown that the smallest Laplacian eigenvalue of such a graph can be realized as the algebraic connectivity (second smallest Laplacian eigenvalue) of a suitable u...
متن کاملEla Extremal Algebraic Connectivities of Certain Caterpillar Classes and Symmetric Caterpillars∗
A caterpillar is a tree in which the removal of all pendant vertices makes it a path. Let d ≥ 3 and n ≥ 6 be given. Let Pd−1 be the path of d − 1 vertices and Sp be the star of p + 1 vertices. Let p = [p1, p2, ..., pd−1] such that p1 ≥ 1, p2 ≥ 1, ..., pd−1 ≥ 1. Let C (p) be the caterpillar obtained from the stars Sp1 , Sp2 , ..., Spd−1 and the path Pd−1 by identifying the root of Spi with the i...
متن کاملEla on the Distance Spectral Radius of Unicyclic Graphs with Perfect Matchings
Abstract. For a connected graph, the distance spectral radius is the largest eigenvalue of its distance matrix. Let U1 2k be the graph obtained from C3 by attaching a path of length n− 3 at one vertex. Let U2 2k be the graph obtained from C3 by attaching a pendant edge together with k − 2 paths of length 2 at the same vertex. In this paper, it is proved that U1 2k (resp., U 2 2k) is the unique ...
متن کامل